Hypercomplex Fourier and Laplace transforms I

Fast Algorithms for the Hypercomplex Fourier Transforms

In multi-dimensional signal processing the Cliiord Fourier transform (CFT or in the 2-D case: quater-nionic Fourier transform/QFT) is a consequent extension of the complex valued Fourier transform. Hence, we need a fast algorithm in order to compute the transform in practical applications. Since the CFT is based on a corresponding Cliiord algebra (CA) and CAs are not commutative in general, we ...

Fractional Fourier transforms of hypercomplex signals

An overview is given to a new approach for obtaining generalized Fourier transforms in the context of hypercomplex analysis (or Clifford analysis). These transforms are applicable to higher-dimensional signals with several components and are different from the classical Fourier transform in that they mix the components of the signal. Subsequently, attention is focused on the special case of the...

Pricing Asian options via Fourier and Laplace transforms

The h-Laplace and q-Laplace transforms

Article history: Received 12 May 2009 Available online 6 October 2009 Submitted by B.S. Thomson

A note on the comparison between Laplace and Sumudu transforms